Matheuristics for Ψ-Learning
نویسندگان
چکیده
Recently, the so-called ψ-learning approach, the Support Vector Machine (SVM) classifier obtained with the ramp loss, has attracted attention from the computational point of view. A Mixed Integer Nonlinear Programming (MINLP) formulation has been proposed for ψ-learning, but solving this MINLP formulation to optimality is only possible for datasets of small size. For datasets of more realistic size, the state-of-the-art is a recent matheuristic, which attempts to solve the MINLP formulation with an optimization engine imposing a time limit. In this technical note, we propose two new matheuristics, the first one based on solving the continuous relaxation of the MINLP formulation, and the second one based on the training of an SVM classifier on a reduced dataset identified by an Integer Linear Problem. Our computational results illustrate the ability of our matheuristics to handle datasets of much larger size than those previously addressed in the literature.
منابع مشابه
A survey on matheuristics for routing problems
In this paper we survey the literature on matheuristics proposed to solve vehicle routing problems. A matheuristic makes use of mathematical programming models in a heuristic framework. Matheuristics have been applied to several different routing problems and include a number of different approaches. We propose a classification in three classes of the matheuristics: decomposition approaches, im...
متن کاملMatheuristics for a Multi-attribute Profit Collecting Vehicle Routing Problem
This paper studies a multi-attribute profit collecting vehicle routing problem, which arises in the collection operations of a charity organisation in the UK. The problem involves a heterogeneous fleet consisting of vehicles of different capacities, mandatory visits to a subset of vertices, time windows, rest requirements associated with maximum driving and working times, and partial collection...
متن کاملRecent Progress Using Matheuristics for Strategic Maritime Inventory Routing
This paper presents an extensive computational study of simple, but prominent matheuristics (i.e., heuristics that rely on mathematical programming models) to find high quality ship schedules and inventory policies for a class of maritime inventory routing problems. Our computational experiments are performed on a set of the publicly available MIRPLib instances. This class of inventory routing ...
متن کاملOptimizing Ψ-learning via Mixed Integer Programming
As a new margin-based classifier, ψ-learning shows great potential for high accuracy. However, the optimization of ψ-learning involves non-convex minimization and is very challenging to implement. In this article, we convert the optimization of ψ-learning into a mixed integer programming (MIP) problem. This enables us to utilize the state-of-art algorithm of MIP to solve ψ-learning. Moreover, t...
متن کامل